Classification of vertex-transitive cubic partial cubes

نویسنده

  • Tilen Marc
چکیده

Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: K2ƒC2n, for some n ≥ 2, generalized Petersen graph G(10, 3), permutahedron, truncated cuboctahedron, or truncated icosidodecahedron. This complete classification of cubic, vertex-transitive partial cubes, a family that includes all cubic, distance-regular partial cubes (Weichsel, 1992), is a generalization of results of Brešar et. al. from 2004 on cubic mirror graphs, and a contribution to the classification of all cubic partial cubes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On cubic and edge-critical isometric subgraphs of hypercubes

All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs were confirmed by computer search to be complete. Non-trivial cubic partial cubes on 36, 42, and 48 vertices are also constructed.

متن کامل

Cubic Non-Cayley Vertex-Transitive Bi-Cayley Graphs over a Regular $p$-Group

A bi-Cayley graph is a graph which admits a semiregular group of automorphisms with two orbits of equal size. In this paper, we give a characterization of cubic nonCayley vertex-transitive bi-Cayley graphs over a regular p-group, where p > 5 is a prime. As an application, a classification of cubic non-Cayley vertex-transitive graphs of order 2p3 is given for each prime p.

متن کامل

Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p

A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive non-Cayley graphs of order 8p are classified for each prime p. It follows from this classification that there are two sporadic and two infini...

متن کامل

Constructing Cubic Edge-but Not Vertex-transitive Graphs

Slovenija Abstract An innnite family of cubic edge-transitive but not vertex-transitive graph graphs with edge stabilizer isomorphic to Z Z 2 is constructed.

متن کامل

Constructing cubic edge- but not vertex-transitive graphs

An in nite family of cubic edge transitive but not vertex transitive graph graphs with edge stabilizer isomorphic to Z is constructed

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 86  شماره 

صفحات  -

تاریخ انتشار 2017